Coarse correlated equilibria in linear duopoly games

نویسندگان

  • Indrajit Ray
  • Sonali Sen Gupta
چکیده

For duopoly models, we analyse the concept of coarse correlated equilibrium using simple symmetric devices that the players choose to commit to in equilibrium. In a linear duopoly game, we prove that Nash-centric devices, involving a sunspot structure, are simple symmetric coarse correlated equilibria. Any small unilateral perturbation from such a structure fails to be an equilibrium.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coarse Correlated Equilibria and Sunspots

For duopoly models, we analyse the concept of coarse correlated equilibrium using simple symmetric devices that the players choose to commit to in equilibrium. In a linear duopoly game, we prove that Nash-centric devices, involving a sunspot structure, are simple symmetric coarse correlated equilibria. Any small unilateral perturbation from such a structure fails to be an equilibrium.

متن کامل

Improving Nash by coarse correlation

We consider a class of symmetric two-person quadratic games where coarse correlated equilibria — CCE — (Moulin and Vial 1978) can strictly improve upon the Nash equilibrium payoffs, while correlated equilibrium — CE — (Aumann 1974, 1987) cannot, because these games are potential games. We compute the largest feasible total utility in any CCE in those games, and show that it is achieved by a CCE...

متن کامل

Improving Nash by Correlation in Quadratic Potential Games∗

We consider a class of quadratic potential games and prove that (simple symmetric) coarse correlated equilibria (as introduced by Moulin and Vial 1978) can strictly improve upon the Nash equilibrium payoffs (that can not be improved upon by correlated equilibrium a la Aumann). We fully characterise the structure of the coarse correlated equilibrium that achieves the maximum improvement possible...

متن کامل

Zero-Sum Polymatrix Games: A Generalization of Minmax

We show that in zero-sum polymatrix games, a multiplayer generalization of two-person zerosum games, Nash equilibria can be found efficiently with linear programming. We also show that the set of coarse correlated equilibria collapses to the set of Nash equilibria. In contrast, other important properties of two-person zero-sum games are not preserved: Nash equilibrium payoffs need not be unique...

متن کامل

Coarse Correlated Equilibria in an Abatement Game

We consider the well-analyzed abatement game (Barrett 1994) and prove that correlation among the players (nations) can strictly improve upon the Nash equilibrium payoffs. As these games are potential games, correlated equilibrium — CE — (Aumann 1974, 1987) cannot improve upon Nash; however we prove that coarse correlated equilibria — CCE — (Moulin and Vial 1978) may do so. We compute the larges...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2013